Evaluation of an achievable rate region for the broadcast channel

نویسندگان

  • Bruce E. Hajek
  • Michael B. Pursley
چکیده

Ahwc-The problem of transmission of separate messages to each of two receivers over a general binary-input broadcast channel is investigated. A new approach to a class of information-t problems is developed and applied to obtain boonds on the cardinalitiea of aoxiliary random variables. These bounds permit the calculation of two different regions of achievable rate pairs which are derived from the Cover-van der Meulen region 5% of achievable rate triples. Numerical evaluation of these regions of rate pairs for two examples demonstrates that the region ‘3, can be enlarged. Tbis enlargement is accomplii by making % internally consistent, as tbe true capacity region most be. The results display complex interactions between common and separate ioformation in broadcast problems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Achievable Secrecy Rate Regions of State Dependent Causal Cognitive Interference Channel

In this paper, the secrecy problem in the state dependent causal cognitive interference channel is studied. The channel state is non-causally known at the cognitive encoder. The message of the cognitive encoder must be kept secret from the primary receiver. We use a coding scheme which is a combination of compress-and-forward strategy with Marton coding, Gel’fand-Pinsker coding and Wyner’s wire...

متن کامل

On the Achievable Rate-Regions for the Gaussian Two-way Diamond Channels

In this channel,we study rate region of a Gaussian two-way diamond channel which operates in half-duplex mode. In this channel, two transceiver (TR) nodes exchange their messages with the help of two relay nodes. We consider a special case of the Gaussian two-way diamond channels which is called Compute-and-Forward Multiple Access Channel (CF-MAC). In the CF-MAC, the TR nodes transmit their mes...

متن کامل

On The Secrecy of the Cognitive Interference Channel with Channel State

In this paper the secrecy problem in the cognitive state-dependent interference channel is considered. In this scenario we have a primary and a cognitive transmitter-receiver pairs. The cognitive transmitter has the message of the primary sender as side information. In addition, the state of the channel is known at the cognitive encoder. Hence, the cognitive encoder uses this side information t...

متن کامل

Duality, achievable rates, and sum-rate capacity of Gaussian MIMO broadcast channels

Abstract— We consider a multi-user multiple input multiple output (MIMO) Gaussian broadcast channel (BC), where the transmitter and receivers have multiple antennas. Since the MIMO broadcast channel is in general a non-degraded broadcast channel, its capacity region remains an unsolved problem. In this paper, we establish a duality between what is termed the “dirty paper” achievable region (the...

متن کامل

A new coding theorem for three user discrete memoryless broadcast channel

We propose a new coding technique based on nested coset codes and derive a new achievable rate region for a general three user discrete memoryless broadcast channel (DMBC). We identify an example of a three user binary broadcast channel for which the proposed achievable rate region strictly outperforms that obtained by a natural extension of Marton’s [1] rate region. As a step towards deriving ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 25  شماره 

صفحات  -

تاریخ انتشار 1979